Decomposing a Planar Graph into Degenerate Graphs
نویسندگان
چکیده
منابع مشابه
Mapping planar graphs into the Coxeter graph
We conjecture that every planar graph of odd-girth at least 11 admits a homomorphism to the Coxeter graph. Supporting this conjecture, we prove that every planar graph of odd-girth at least 17 admits a homomorphism to the Coxeter graph.
متن کاملDecomposing the Higman-Sims graph into double Petersen graphs
It has been known for some time that the Higman-Sims graph can be decomposed into the disjoint union of two Hoffman-Singleton graphs. In this paper we establish that the Higman-Sims graph can be edge decomposed into the disjoint union of 5 double-Petersen graphs, each on 20 vertices. It is shown that in fact this can be achieved in 36960 distinct ways. It is also shown that these different ways...
متن کاملDecomposing a planar graph with girth 9 into a forest and a matching
W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملDecomposing a Graph Into Expanding Subgraphs
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that any graph is close to being the disjoint union of expanders. Our goal in this paper is to show that in several of the instantiations of the above approach, the quantitative bounds that were obtained are essentially best possible. Three exampl...
متن کاملDecomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1995
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1057